On the Difference of Expected Lengths of Minimum Spanning Trees
نویسندگان
چکیده
An exact formula for the expected length of the minimum spanning tree of a connected graph, with independent and identical edge distribution, is given, which generalizes Steele’s formula in the uniform case. For a complete graph, the difference of expected lengths between exponential distribution, with rate one, and uniform distribution on the interval (0, 1) is shown to be positive and of rate ζ(3)/n. For wheel graphs, precise values of expected lengths are given via calculations of the associated Tutte polynomials.
منابع مشابه
A Note on Random Minimum Length Spanning Trees
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning tree. We show in this paper that if G is sufficiently highly edge connected then the expected length of a minimum spanning tree is ∼ nr ζ(3). If we omit the edge connectivity condition, then it is at most ∼ nr (ζ(3) +...
متن کاملExpected Lengths of Minimum Spanning Trees for Non-identical Edge Distributions
An exact general formula for the expected length of the minimal spanning tree (MST) of a connected (possibly with loops and multiple edges) graph whose edges are assigned lengths according to independent (not necessarily identical) distributed random variables is developed in terms of the multivariate Tutte polynomial (alias Potts model). Our work was inspired by Steele’s formula based on two-v...
متن کاملApproximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
We consider the stochastic graph model where the location of each vertex is a random point in a given metric space. We study the problems of computing the expected lengths of the minimum spanning tree, the minimum perfect matching and the minimum cycle cover on such a stochastic graph and obtain an FPRAS (Fully Polynomial Randomized Approximation Scheme) for each of these problems. Our result f...
متن کاملOptimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
متن کاملExact Expectations of Minimal Spanning Trees for Graphs with Random Edge Weights
Two methods are used to compute the expected value of the length of the minimal spanning tree (MST) of a graph whose edges are assigned lengths which are independent and uniformly distributed. The first method yields an exact formula in terms of the Tutte polynomial. As an illustration, the expected length of the MST of the Petersen graph is found to be 34877/12012 = 2.9035 . . .. A second, mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 18 شماره
صفحات -
تاریخ انتشار 2009